A quadratic convergence method for the management equilibrium model
نویسنده
چکیده
in this paper, we study a class of methods for solving the management equilibrium model. We first give an estimate of the error bound for the model, and then, based on the estimate of the error bound, propose a method for solving the model. We prove that our algorithm is quadratically convergent without the requirement of existence of a non-degenerate solution. Keywords—Management equilibrium model; estimation of error bound; algorithm; quadratic convergence
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملEstimation of the Domain of Attraction of Free Tumor Equilibrium Point for Perturbed Tumor Immunotherapy Model
In this paper, we are going to estimate the domain of attraction of tumor-free equilibrium points in a perturbed cancer tumor model describing the tumor-immune system competition dynamics. The proposed method is based on an optimization problem solution for a chosen Lyapunov function that can be casted in terms of Linear Matrix Inequalities constraint and Taylor expansion of nonlinear terms. We...
متن کاملDeveloping a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کامل